#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>

void BubbleSort(int arr[], int l)
{
	int i = 0;
	for (i = 0; i < l; i++)
	{
		int j = 0;
		for (j = 0; j < l-1; j++)
		{
			if (arr[j] > arr[j + 1])
			{
				int e = arr[j];
				arr[j] = arr[j + 1];
				arr[j + 1] = e;
			}
		}
	}
}

int BinaryFind(int arr[], int obj, int l)
{
	int left = 0;
	int right = l - 1;
	while (left <= right)
	{
		int mid = (left + right) / 2;
		if (obj < arr[mid])
		{
			right = mid;
		}
		else if (obj > arr[mid])
		{
			left = mid+1;
		}
		else if (obj == arr[mid])
		{
			return mid;
		}
	}
}

long long Fac(size_t N)
{
	if (0 == N)
	{
		return 1;
	}
	return Fac(N - 1) * N;
}

long long* Fibonacci(size_t N)
{
	long long* fibArray = (long long*)std::malloc((N + 1) * sizeof(long long));
	fibArray[0] = 1;
	fibArray[1] = 1;
	for (int i = 2; i <= N; i++)
	{
		fibArray[i] = fibArray[i - 1] + fibArray[i - 2];
	}
	return fibArray;
}

int main()
{
	// If you create stacks,they are not in the Capital O complexities??????

	return 0;
}